/**
*      author: Y_Yao
*      created: 2025-04-01 07:48:18
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 9e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int n,m;
vector<int> G[N];
int ans;
int fa[N],sz[N];

int find(int x)
{
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}

void Union(int u,int v)
{
    u = find(u);
    v = find(v);
    if(u == v)
    {
        ans++;
        return;
    }
    if(sz[u] > sz[v]) swap(u,v);
    fa[u] = v;
    sz[v] += sz[u];
}


void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        fa[i] = i;
        sz[i] = 1;
    }
    for(int i = 1;i <= m;i++)
    {
        int u,v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
        Union(u,v);
    }
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}